Local Edge Matching for Seamless Adjacent Spatial Datasets with Sequence Alignment

نویسنده

  • Yong Huh
چکیده

This study proposes a local edge matching method with a sequence alignment technique for adjacent spatial datasets. By assuming that the common boundary edges of the datasets are point strings, the proposed method obtains the sequence for point edit operations to align the edges by using the string matching algorithm with the following operations: (1) snapping two points from each string to their average position, (2) removing a point from one string and (3) removing a point from the other string. The costs for these operations are derived from the deformation of the involved line segments in terms of the angle and length changes. The corresponding point pairs are then considered point pairs for which the snapping operation is chosen in a sequence. Based on these pairs, a border area of adjacent spatial datasets can be partitioned into sub-border areas where distinctive matching and alignment processes can be performed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

gpALIGNER: A Fast Algorithm for Global Pairwise Alignment of DNA Sequences

Bioinformatics, through the sequencing of the full genomes for many species, is increasingly relying on efficient global alignment tools exhibiting both high sensitivity and specificity. Many computational algorithms have been applied for solving the sequence alignment problem. Dynamic programming, statistical methods, approximation and heuristic algorithms are the most common methods appli...

متن کامل

Local Derivative Pattern with Smart Thresholding: Local Composition Derivative Pattern for Palmprint Matching

Palmprint recognition is a new biometrics system based on physiological characteristics of the palmprint, which includes rich, stable, and unique features such as lines, points, and texture. Texture is one of the most important features extracted from low resolution images. In this paper, a new local descriptor, Local Composition Derivative Pattern (LCDP) is proposed to extract smartly stronger...

متن کامل

Matching of Polygon Objects by Optimizing Geometric Criteria

Despite the semantic criteria, geometric criteria have different performances on polygon feature matching in different vector datasets. By using these criteria for measuring the similarity of two polygons in all matchings, the same results would not have been obtained. To achieve the best matching results, the determination of optimal geometric criteria for each dataset is considered necessary....

متن کامل

Eternal m- Security Subdivision Numbers in Graphs

Let  be a simple graph with vertex set  and edges set . A set  is a dominating set if every vertex in  is adjacent to at least one vertex  in . An eternal 1-secure set of a graph G is defined as a dominating set  such that for any positive integer k and any sequence  of vertices, there exists a sequence of guards   with  and either  or  and  is a dominating set. If we take a guard on every ver...

متن کامل

A Bioinformatics Approach to 3D Shape Matching

In this paper we exploit the effectiveness of bioinformatics tools to deal with 3D shape matching. The key idea is to transform the shape into a biological sequence and take advantage of bioinformatics tools for sequence alignment to improve shape matching. In order to extract a reliable ordering of mesh vertices we employ the spectral-based sequencing method derived from the well known Fiedler...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • ISPRS Int. J. Geo-Information

دوره 4  شماره 

صفحات  -

تاریخ انتشار 2015